Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs
نویسندگان
چکیده
K e y w o r d s : graphs, algori thms, HHD-free graphs, t reewidth, min imum fill-in. MSC: 68R10. 1 I n t r o d u c t i o n A graph is HHD-free if it does not contain a house (i.e., the complement of Ps), a hole (Ck for k _> 5) or a domino (see Figure 1). Fig. 1. 'House' (left), 'hole' (middle) and 'domino' (right) * kloks@math, utwente, nl
منابع مشابه
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is the number of minimal separators of the input graph. This yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs tha...
متن کاملExact Algorithms for Treewidth and Minimum Fill-In
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1.8899). Our results are based on combinatorial proofs that an n-vertex graph has O(1.7087) minimal separators and O(1.8135) potential maximal cliques. We also show that for the class of AT-free graphs the running time of our algorithms can be reduced to O(1.4142).
متن کاملTreewidth and Minimum Fill-in on d-Trapezoid Graphs
We show that the minimum fill-in and the minimum interval graph completion of a d-trapezoid graph can be computed in time O(n). We also show that the treewidth and the pathwidth of a d-trapezoid graph can be computed by an O(n tw(G) ) time algorithm. For both algorithms, d is supposed to be a fixed positive integer and it is required that a suitable intersection model of the given d-trapezoid g...
متن کاملMinimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For this purpose we define split+ke and split+kv graphs to be the graphs that can be made split by removing at most k edges and at most k vertices, respectively. We show that problems like treewidth and minimum fill-in are ...
متن کاملMinimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
We show that a minimum ll-in ordering of a graph can be determined in linear time if it can be modularly decomposed into chordal graphs. This generalizes results of 2]. We show that the treewidth of these graphs can be determined in O((n + m) log n) time.
متن کامل